cross ddomain sentiment classif spectral featur align context dawar onlin commerci intent detect abstract commerci activ move internet peopl tend purchas internet conduct onlin research actual transact happen web user onlin commerci activ start submit search queri search engin common web search queri queri commerci intent short recogn queri commerci intent common queri search engin provid proper search result advertis web user obtain inform desir advertis benefit potenti transact intent queri vari lot user background interest intent user queri issu context paper present algorithm framework base skip chain condit random field sccrf automat classifi web queri context base onlin commerci intent analyz algorithm perform theoret empir extens experi real search engin log dataset show algorithm improv score previou algorithm commerci intent detect pqc person queri classif queri classif qc task aim classifi web queri topic categori queri short length ambigu queri classifi categori peopl perspect paper propos person queri classif pqc task develop algorithm base user prefer learn solut user prefer hidden clickthrough log help search engin improv understand user queri propos connect queri classif user prefer learn clickthrough log pqc tackl spars problem clickthrough log propos collabor rank model leverag similar user inform experi real world clickthrough log data show propos pqc algorithm gain signific improv compar gener qc natur baselin method appli wide rang applic includ person search onlin advertis probabilist similar queri dimens incomplet data effect multi dlabel activ learn text classif context dawar queri classif abstract commerci activ move internet peopl tend purchas internet conduct onlin research actual transact happen web user onlin commerci activ start submit search queri search engin common web search queri queri commerci intent short recogn queri commerci intent common queri search engin provid proper search result advertis web user obtain inform desir advertis benefit potenti transact intent queri vari lot user background interest intent user queri issu context paper present algorithm framework base skip chain condit random field sccrf automat classifi web queri context base onlin commerci intent analyz algorithm perform theoret empir extens experi real search engin log dataset show algorithm improv score previou algorithm commerci intent detect understand user queri intent wikipedia mine multilingu topic wikipedia abstract topic model studi extens context monolingu corpora attempt mine topic structur cross lingual corpora requir clue document align paper present gener model call jointlda bilingu dictionari mine multilingu topic unalign corpu experi conduct data set confirm conjectur jointli model cross lingual corpora offer advantag compar individu monolingu model jointlda model merg relat topic languag singl multilingu topic fit data fewer topic abil predict relat word languag document fact predict power compar bag word base translat model leav possibl jointlda prefer bag word model cross lingual ir applic found monolingu model learnt optim cross lingual copora effect lda model understand user queri intent wikipedia text gener text mine metric entiti extract hidden markov model hub author inform extract inform retriev kei phrase assign kei phrase extract knowledg engin languag identif link analysi machin learn metadata natur languag process ngram rule learn syntact analysi term frequenc text categor text mine text learn bidirect similar collabor filter dirichletrank solv gap problem pagerank shine search heterogen interrel entiti featur select kernel space address problem featur select kernel space select discrimin inform featur classif data analysi difficult problem dimens kernel space infinit past work featur select kernel space solv problem deriv basi set kernel space step featur select basi set extend margin base featur select algorithm proven effect featur depend select featur form subspac kernel space state art classif algorithm appli classif conduct extens experi real simul data compar propos method baselin algorithm theoret analysi experiment result valid effect propos method detect track latent factor onlin nonneg matrix factor document summar condit random field method includ supervis unsupervis algorithm develop extract document summar supervis method summar task twoclass classif problem classifi sentenc individu leverag relationship sentenc unsupervis method heurist rule select inform sentenc summari directli hard gener paper present condit random field crf base framework merit kind approach avoid disadvantag propos framework outcom previou method featur seamlessli integr kei idea approach treat summar task sequenc label problem view document sequenc sentenc summar procedur label sentenc label sentenc depend assign label compar propos approach exist method open benchmark data set result show approach improv perform supervis baselin unsupervis baselin term popular metric roug detail analysi improv present text classif improv multigram model text classif improv automat extract sequenc subject categor weblog part dof dspeech base smooth latent friend mine blog data rapid growth blog weblog data rich resourc social commun mine paper put forward research problem mine latent friend blogger base content blog entri latent friend defin paper peopl share similar topic distribut blog peopl interest potenti find approach design latent friend detect call cosin similar base method determin similar blogger calcul cosin similar content blog approach topic base method base discoveri latent topic latent topic model calcul similar topic level level similar base conduct stage stage exist topic hierarchi exploit build topic distribut blogger stage detail similar comparison conduct blogger close interest discov stage experiment result show topic base level similar base method work approach perform paper give detail analysi advantag disadvantag approach latent friend mine blog data rapid growth blog weblog data rich resourc social commun mine paper put forward research problem mine latent friend blogger base content blog entri latent friend defin paper peopl share similar topic distribut blog peopl interest potenti find approach design latent friend detect call cosin similar base method determin similar blogger calcul cosin similar content blog approach topic base method base discoveri latent topic latent topic model calcul similar topic level level similar base conduct stage stage exist topic hierarchi exploit build topic distribut blogger stage detail similar comparison conduct blogger close interest discov stage experiment result show topic base level similar base method work approach perform paper give detail analysi advantag disadvantag approach build bridg web queri classif web queri classif qc aim classifi web user queri short ambigu set target categori qc applic includ page rank web search target advertis respons queri person paper present approach qc outperform win solut acm kddcup competit object classifi real user queri approach build bridg classifi intermedi taxonomi offlin mode classifi onlin mode map user queri target categori intermedi taxonomi major innov leverag similar distribut intermedi taxonomi retrain classifi set target categori bridg classifi train addit introduc categori select method narrow scope intermedi taxonomi base classifi queri categori select improv effici effect onlin classif combin algorithm win solut kddcup made improv term precis compar result kddcup build bridg web queri classif web queri classif qc aim classifi web user queri short ambigu set target categori qc applic includ page rank web search target advertis respons queri person paper present approach qc outperform win solut acm kddcup competit object classifi real user queri approach build bridg classifi intermedi taxonomi offlin mode classifi onlin mode map user queri target categori intermedi taxonomi major innov leverag similar distribut intermedi taxonomi retrain classifi set target categori bridg classifi train addit introduc categori select method narrow scope intermedi taxonomi base classifi queri categori select improv effici effect onlin classif combin algorithm win solut kddcup made improv term precis compar result kddcup latent semant analysi multipl dtype interrel data object occurr data common real applic latent semant analysi lsa successfulli identifi semant relat data lsa handl singl occurr relationship type object practic applic case multipl type object exist pair object pairwis occurr relat occurr relat exploit allevi data spars repres object meaningfulli paper propos algorithm lsa conduct latent semant analysi incorpor pairwis occurr multipl type object base mutual reinforc principl lsa identifi salient concept occurr data repres object unifi semant space lsa gener show variant lsa special case algorithm experi result show lsa outperform lsa multipl applic includ collabor filter text cluster text categor thread detect dynam text messag stream cw compar web search system comparison implicit explicit link web page classif web page classif enhanc hyperlink provid linkag web page web space hyperlink spars noisi situat provid limit classif paper extend concept linkag explicit hyperlink implicit link built web page observ peopl search web queri click di erent relat document draw implicit link web page click queri page implicitli link provid approach automat build implicit link web page web queri log comparison implicit explicit link web page classif experiment result larg dataset confirm implicit link explicit link classif perform increas term macro measur mine clickthrough data collabor web search mine clickthrough data collabor web search practic system keyphras extract web page algorithm comput minim enclos sphere featur space web dpage summar clickthrough data previou web page summar method treat web page plain text method fail uncov full knowledg web page build high qualiti summari web hidden relationship method uncov inher knowledg import build good web page summar paper extract extra knowledg clickthrough data web search engin improv web page summar analyz feasibl util clickthrough data text summar propos adapt summar method advantag relationship discov clickthrough data page cover clickthrough data put forward themat lexicon approach gener implicit knowledg method evalu small dataset consist manual annot page larg dataset crawl open directori project websit experiment result signific improv achiev propos summar compar summar clickthrough data categori subject descriptor inform system applic miscellan pattern recognit applic text process svm method web page categor base weight adjust boost mechan web dpage summar clickthrough data previou web page summar method treat web page plain text method fail uncov full knowledg web page build high qualiti summari web hidden relationship method uncov inher knowledg import build good web page summar paper extract extra knowledg clickthrough data web search engin improv web page summar analyz feasibl util clickthrough data text summar propos adapt summar method advantag relationship discov clickthrough data page cover clickthrough data put forward themat lexicon approach gener implicit knowledg method evalu small dataset consist manual annot page larg dataset crawl open directori project websit experiment result signific improv achiev propos summar compar summar clickthrough data categori subject descriptor inform system applic miscellan pattern recognit applic text process cubesvd approach person web search competit web search market increas high demand person web search conduct retriev incorpor web user inform paper focus util clickthrough data improv web search million search conduct everydai search engin accumul larg volum clickthrough data record submit queri page click clickthrough data highli spars di erent type object user queri web page relationship object complic perform analysi data attempt discov web user interest pattern user locat inform paper approach cubesvd propos improv web search clickthrough data repres order tensor perform mode analysi higher order singular decomposit techniqu automat captur latent factor govern relat multi type object user queri web page tensor reconstruct base cubesvd analysi reflect observ interact object implicit associ web search activ carri base cubesvd analysi experiment evalu real world data set collect msn search engin show cubesvd achiev encourag search result comparison standard method ust win solut queri classif kddcup supervis latent semant index document categor ge dcko method optim composit kernel web page classif current research web page classif focu leverag heterogen featur plain text hyperlink anchor text effect effici composit kernel method topic interest select bunch initi kernel determin separ type featur classifi train base linear combin kernel paper propos effect optim linear combin kernel prove problem equival solv gener eigenvalu problem weight vector kernel eigenvector largest eigenvalu support vector machin svm classifi train base optim combin kernel experi webkb dataset shown effect propos method 